Inequivalent representations of matroids over prime fields
نویسندگان
چکیده
Article history: Received 30 March 2011 Accepted 18 February 2013 Available online 15 March 2013
منابع مشابه
On inequivalent representations of matroids over non-prime fields
For each finite field F of prime order there is a constant c such that every 4-connected matroid has at most c inequivalent representations over F. We had hoped that this would extend to all finite fields, however, it was not to be. The (m,n)-mace is the matroid obtained by adding a point freely to M(Km,n). For all n ≥ 3, the (3, n)-mace is 4-connected and has at least 2 representations over an...
متن کاملStabilizers for GF(5)-representable matroids
The matroid terminology follows Oxley [4]. Two r×n matrices A and A′ representing the same matroid M over a field GF(q) are called projectively equivalent representations of M if one can be obtained from the other by elementary row operations and column scaling. Otherwise they are called projectively inequivalent. The matrices A and A′ are called equivalent representations of M if, in addition ...
متن کاملInequivalent representations of matroids having no U3, 6-minor
It is proved that, for any prime power q; a 3-connected matroid with no U3;6-minor has at most ðq 2Þ! inequivalent representations over GFðqÞ: r 2004 Elsevier Inc. All rights reserved.
متن کاملUnlabeled equivalence for matroids representable over finite fields
Two r × n matrices A and A′ representing the same matroid M over GF (q), where q is a prime power, are projective equivalent representations of M if one can be obtained from the other by elementary row operations and column scaling. Bounds for projective inequivalence are difficult to obtain and are known for only a few special classes of matroids. In this paper we define two matrices A and A′ ...
متن کاملOn Inequivalent Representations of Matroids over Finite Fields
Kahn conjectured in 1988 that, for each prime power q, there is an integer n(q) such that no 3-connected GF(q)-representable matroid has more than n(q) inequivalent GF(q)-representations. At the time, this conjecture was known to be true for q=2 and q=3, and Kahn had just proved it for q=4. In this paper, we prove the conjecture for q=5, showing that 6 is a sharp value for n(5). Moreover, we al...
متن کامل